Mixing Time Bounds via Bottleneck Sequences
نویسندگان
چکیده
منابع مشابه
Robustness of Mixing under Rough Isometry, via Bottleneck Sequences
We provide new upper bounds for mixing times of general finte Markov chains. We use these bounds to show that the total variation mixing time is robust under rough isometry for bounded degree graphs that are roughly isometric to trees.
متن کاملMixing time bounds for overlapping cycles shuffles
Consider a deck of n cards. Let p1, p2, . . . , pn be a probability vector and consider the mixing time of the card shuffle which at each step of time picks a position according to the pi’s and move the card in that position to the top. This setup was introduced in [5], where a few special cases were studied. In particular the case pn−k = pn = 1/2, k = Θ(n), turned out to be challenging and onl...
متن کاملMixing Time Bounds via the Spectral Profile Sharad Goel, Ravi Montenegro and Prasad Tetali
On complete, non-compact manifolds and infinite graphs, FaberKrahn inequalities have been used to estimate the rate of decay of the heat kernel. We develop this technique in the setting of finite Markov chains, proving upper and lower L mixing time bounds via the spectral profile. This approach lets us recover and refine previous conductance-based bounds of mixing time (including the Morris-Per...
متن کاملBounding the mixing time via coupling
It is convenient to transform G to a directed graph ←→ G , and look at absorbences of G. From G, we form ←→ G by replacing each edge (u, v) by a pair of anti-parallel edges −→ uv and −→ vu. An absorbence rooted at a vertex r of a directed graph is a subset S of edges, such that |S| = |V | − 1 and every vertex, except r, has exactly one edge directed away from it, thus S forms a tree rooted at r...
متن کاملImproved Mixing Time Bounds for the Thorp Shuffle
E. Thorp introduced the following card shuffling model. Suppose the number of cards n is even. Cut the deck into two equal piles. Drop the first card from the left pile or from the right pile according to the outcome of a fair coin flip. Then drop from the other pile. Continue this way until both piles are empty. We show that if n is a power of 2 then the mixing time of the Thorp shuffle is O(l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Physics
سال: 2017
ISSN: 0022-4715,1572-9613
DOI: 10.1007/s10955-017-1917-5